Extremal Sombor Indices of Tetracyclic (Chemical) Graphs
نویسندگان
چکیده
منابع مشابه
extremal tetracyclic graphs with respect to the first and second zagreb indices
the first zagreb index, $m_1(g)$, and second zagreb index, $m_2(g)$, of the graph $g$ is defined as $m_{1}(g)=sum_{vin v(g)}d^{2}(v)$ and $m_{2}(g)=sum_{e=uvin e(g)}d(u)d(v),$ where $d(u)$ denotes the degree of vertex $u$. in this paper, the firstand second maximum values of the first and second zagreb indicesin the class of all $n-$vertex tetracyclic graphs are presented.
متن کاملCharacterization of graphs having extremal Randić indices
The higher Randić index Rt (G) of a simple graph G is defined as Rt (G) = ∑ i1i2···it+1 1 √ δi1δi2 · · · δit+1 , where δi denotes the degree of the vertex i and i1i2 · · · it+1 runs over all paths of length t in G. In [J.A. Rodríguez, A spectral approach to the Randić index, Linear Algebra Appl. 400 (2005) 339–344], the lower and upper bound on R1(G) was determined in terms of a kind of Laplaci...
متن کاملVariable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees
Chemical graphs, as other ones, are regular if all their vertices have the same degree. Otherwise, they are irregular, and it is of interest to measure their irregularity both for descriptive purposes and for QSAR/QSPR studies. Three indices have been proposed in the literature for that purpose: those of Collatz-Sinogowitz, of Albertson, and of Bell's variance of degrees. We study their propert...
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملTricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
Let $G$ be a connected graph on $n$ vertices. $G$ is called tricyclic if it has $n + 2$ edges, and tetracyclic if $G$ has exactly $n + 3$ edges. Suppose $mathcal{C}_n$ and $mathcal{D}_n$ denote the set of all tricyclic and tetracyclic $n-$vertex graphs, respectively. The aim of this paper is to calculate the minimum and maximum of eccentric connectivity index in $mathcal{C}_n$ and $mathcal{D}_n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Match
سال: 2022
ISSN: ['0340-6253']
DOI: https://doi.org/10.46793/match.88-3.573l